The Fréchet/Manhattan Distance and the Trajectory Anonymisation Problem
نویسندگان
چکیده
Mobile communication has grown quickly in the last two decades. Connections can be wirelessly established from almost any habitable place in the earth, leading to a plethora of connection-based tracking mechanisms, such as GPS, GSM, RFID, etc. Trajectories representing the movement of people are consequently being gathered and analysed in a daily basis. However, a trajectory may contain sensitive and private information, which raises the problem of whether spatio-temporal data can be published in a private manner. In this article, we introduce a novel distance measure for trajectories that captures both aspect of the microaggregation process, namely clustering and obfuscation. Based on this distance measure we propose a trajectory anonymisation heuristic method ensuring that each trajectory is indistinguishable from k− 1 other trajectories. The proposed distance measure is loosely based on the Fréchet distance, yet it can be computed efficiently in quadratic time complexity. Empirical studies on synthetic trajectories show that our anonymisation approach improves previous work in terms of utility without sacrificing privacy.
منابع مشابه
An Efficient Query Algorithm for Trajectory Similarity Based on Fréchet Distance Threshold
The processing and analysis of trajectories are the core of many location-based applications and services, while trajectory similarity is an essential concept regularly used. To address the time-consuming problem of similarity query, an efficient algorithm based on Fréchet distance called Ordered Coverage Judge (OCJ) is proposed, which could realize the filtering query with a given Fréchet dist...
متن کاملDetecting Commuting Patterns by Clustering Subtrajectories
In this paper we consider the problem of detecting commuting patterns in a trajectory. For this we search for similar subtrajectories. To measure spatial similarity we choose the Fréchet distance and the discrete Fréchet distance between subtrajectories, which are invariant under differences in speed. We give several approximation algorithms, and also show that the problem of finding the ‘longe...
متن کاملMining Trajectory Corridors Using Fréchet Distance and Meshing Grids
With technology advancement and increasing popularity of location-aware devices, trajectory data are ubiquitous in the real world. Trajectory corridor, as one of the moving patterns, is composed of concatenated sub-trajectory clusters which help analyze the behaviors of moving objects. In this paper we adopt a three-phase approach to discover trajectory corridors using Fréchet distance as a dis...
متن کاملMining Trajectory Corridors Using Fréchet Distance and Meshing Grids
With technology advancement and increasing popularity of location-aware devices, trajectory data are ubiquitous in the real world. Trajectory corridor, as one of the moving patterns, is composed of concatenated subtrajectory clusters which help analyze the behaviors of moving objects. In this paper we adopt a three-phase approach to discover trajectory corridors using Fréchet distance as a diss...
متن کاملIdentifying Common Portions between Two Trajectories
1 Introduction Trajectories are functions from a time domain—an interval on the real line—to R d with d > 1, and observed as sequences of points sampled from them. A fundamental problem in analyzing this data is that of identifying common patterns between pairs or among groups of trajecto-ries observed as sequences of sampled points. be two sequences of points in R d , sampled from two trajecto...
متن کامل